Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
نویسندگان
چکیده
منابع مشابه
Approximating Spanning Trees with Low Crossing Number
We present a linear programming based algorithm for computing a spanning tree T of a set P of n points in IR, such that its crossing number is O(min(t log n, n1−1/d)), where t the minimum crossing number of any spanning tree of P . This is the first guaranteed approximation algorithm for this problem. We provide a similar approximation algorithm for the more general settings of building a spann...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1992
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0221035